Optimal harmonic period assignment: complexity results and approximation algorithms
نویسندگان
چکیده
منابع مشابه
Generalized p-Center problems: Complexity results and approximation algorithms
In an earlier paper Hud91], two \alternative" p-Center problems, where the centers serving customers must be chosen so that exactly one node from each of p prespeciied disjoint pairs of nodes is selected, were shown to be NP-complete. This paper considers a generalized version of these problems, in which the nodes from which the p servers are to be selected are partitioned into k sets and the n...
متن کاملApproximation Algorithms for Wavelength Assignment
Winkler and Zhang introduced the FIBER MINIMIZATION problem in [3]. They showed that the problem is NP-complete but left the question of approximation algorithms open. We give a simple 2-approximation algorithm for this problem. We also show how ideas from the Dynamic Storage Allocation algorithm of Buchsbaum et al [1] can be used to give an approximation ratio arbitrarily close to 1 provided t...
متن کاملComplexity Classes , and Approximation Algorithms
We survey recent results about game-theoretic characterizations of computational complexity classes. We also show how these results are used to prove that certain natural optimization functions are as hard to approximate closely as they are to compute exactly. 1991 Mathematics Subject Classi cation: 68Q15
متن کاملParameterized Complexity and Approximation Algorithms
. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York.Page 18 of 19D. MARX THE COMPUTER JOURNAL, 2007 [113] Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-timeapproximation schemes for geometric intersection graphs.SIAM J. Comput., 34, 1302–1323. [114] Hochbaum, D.S. and Maass, W. (1985) Approximationschemes for cov...
متن کاملApproximation algorithms for NMR spectral peak assignment
We study a constrained bipartite matching problem where the input is a weighted bipartite graph G = (U, V,E), U is a set of vertices following a sequential order, V is another set of vertices partitioned into a collection of disjoint subsets, each following a sequential order, and E is a set of edges between U and V with non-negative weights. The objective is to find a matching in G with the ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2018
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-018-9304-0